Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty

Knowledge about complex events is usually incomplete in practice. Zeros can be utilized to capture such events within probability models. In this article, Geiger and Pearl’s conditional probabilistic independence statements are investigated in the presence of zeros. Random variables can be specified to be zero-free, i.e., to disallow zeros in their domains. Zero-free random variables provide an...

متن کامل

Propositional Reasoning about Saturated Conditional Probabilistic Independence

Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Unfortunately, the problem does not enjoy a finite ground axiomatization and is already coNP-complete to decide for restricted sub...

متن کامل

Reasoning about Saturated Conditional Independence Under Uncertainty: Axioms, Algorithms, and Levesque's Situations to the Rescue

The implication problem of probabilistic conditional independencies is investigated in the presence of missing data. Here, graph separation axioms fail to hold for saturated conditional independencies, unlike the known idealized case with no missing data. Several axiomatic, algorithmic, and logical characterizations of the implication problem for saturated conditional independencies are establi...

متن کامل

Probabilistic Conditional Independence under Schema Certainty and Uncertainty

Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Saturated conditional independencies form an important subclass of conditional independencies. Under schema certainty, the implica...

متن کامل

Probabilistic Conditional Independence Structuresand

1 Franti sek Mat u s Prague ABSTRACT. Special conditional independence structures have been recognized to be matroids. This opens new possibilities for the application of matroid theory methods (duality, minors, expansions) to the study of conditional independence and, on the other hand, starts a new probabilistic branch of matroid representation theory. 2

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Logic

سال: 2013

ISSN: 1570-8683

DOI: 10.1016/j.jal.2013.05.004